Analysis $\ell_1$-recovery with frames and Gaussian measurements
نویسندگان
چکیده
This paper provides novel results for the recovery of signals from undersampled measurements based on analysis `1-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery guarantees for cosparse (analysissparse) signals using Gaussian random measurement matrices. The nonuniform result relies on a recovery condition via tangent cones and the uniform recovery guarantee is based on an analysis version of the null space property. Examining these conditions for Gaussian random matrices leads to precise bounds on the number of measurements required for successful recovery. In the special case of standard sparsity, our result improves a bound due to Rudelson and Vershynin concerning the exact reconstruction of sparse signals from Gaussian measurements with respect to the constant and extends it to stability under passing to approximately sparse signals and to robustness under noise on the measurements.
منابع مشابه
Robust analysis $\ell_1$-recovery from Gaussian measurements and total variation minimization
Analysis `1-recovery refers to a technique of recovering a signal that is sparse in some transform domain from incomplete corrupted measurements. This includes total variation minimization as an important special case when the transform domain is generated by a difference operator. In the present paper we provide a bound on the number of Gaussian measurements required for successful recovery fo...
متن کاملOne-bit compressed sensing with partial Gaussian circulant matrices
In this paper we consider memoryless one-bit compressed sensing with randomly subsampled Gaussian circulant matrices. We show that in a small sparsity regime and for small enough accuracy $\delta$, $m\sim \delta^{-4} s\log(N/s\delta)$ measurements suffice to reconstruct the direction of any $s$-sparse vector up to accuracy $\delta$ via an efficient program. We derive this result by proving that...
متن کاملAnalysis ℓ1-recovery with frames and Gaussian measurements
This paper provides novel results for the recovery of signals from undersampled measurements based on analysis `1-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery guarantees for cosparse (analysissparse) signals using Gaussian random measurement matrices. The nonuniform result relies on a recovery condition via tangent cones...
متن کاملAnalyzing Weighted $\ell_1$ Minimization for Sparse Recovery with Nonuniform Sparse Models\footnote{The results of this paper were presented in part at the International Symposium on Information Theory, ISIT 2009}
In this paper we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted l1 minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted l1 minimization recovery algorithm and analyze its perfor...
متن کاملPerformance Analysis of $\ell_1$-synthesis with Coherent Frames
Signals with sparse frame representations comprise a much more realistic model of nature than that with orthonomal bases. Studies about the signal recovery associated with such sparsity models have been one of major focuses in compressed sensing. In such settings, one important and widely used signal recovery approach is known as l1synthesis (or Basis Pursuit). We present in this article a more...
متن کامل